منابع مشابه
Covers of Point-Hyperplane Graphs
A cover of the non-incident point-hyperplane graph of projective dimension 3 for fields of characteristic 2 is constructed. For fields F of even order larger than 2, this leads to an elementary construction of the non-split extension of SL4(F) by F6.
متن کامل3 Covers of Point - Hyperplane Graphs
We construct a cover of the non-incident point-hyperplane graph of projective dimension 3 for fields of characteristic 2. If the cardinality of the field is larger than 2, we obtain an elementary construction of the non-split extension of SL 4 (F) by F 6 .
متن کاملLocal Recognition Of Non-Incident Point-Hyperplane Graphs
Let P be a projective space. By H(P) we denote the graph whose vertices are the non-incident point-hyperplane pairs of P, two vertices (p,H) and (q, I) being adjacent if and only if p ∈ I and q ∈ H. In this paper we give a characterization of the graph H(P) (as well as of some related graphs) by its local structure. We apply this result by two characterizations of groups G with PSLn(F) ≤ G ≤ PG...
متن کاملReference Point Hyperplane Trees
Our context of interest is tree-structured exact search in metric spaces. We make the simple observation that, the deeper a data item is within the tree, the higher the probability of that item being excluded from a search. Assuming a fixed and independent probability p of any subtree being excluded at query time, the probability of an individual data item being accessed is (1− p) for a node at...
متن کاملPartial covers of graphs
Given graphs G and H, a mapping f : V (G) → V (H) is a homomorphism if (f(u), f(v)) is an edge of H for every edge (u, v) of G. In this paper, we initiate the study of computational complexity of locally injective homomorphisms called partial covers of graphs. We motivate the study of partial covers by showing a correspondence to generalized (2,1)-colorings of graphs, the notion stemming from a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2005
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-005-4530-7